Efficient Engines for Keyword Proximity Search
نویسندگان
چکیده
This paper presents a formal framework for investigating keyword proximity search. Within this framework, three variants of keyword proximity search are defined. For each variant, there are algorithms for enumerating all the results in an arbitrary order, in the exact order and in an approximate order. The algorithms for enumerating in the exact order make the inevitable assumption that the size of the query (i.e., the number of keywords) is fixed, but the other algorithms do not make this assumption. All the algorithms are provably efficient, that is, run with polynomial delay. The algorithms for enumerating in an approximate order are provably correct for a natural notion of approximation that is defined in this paper.
منابع مشابه
An Effective Path-aware Approach for Keyword Search over Data Graphs
Abstract—Keyword Search is known as a user-friendly alternative for structured languages to retrieve information from graph-structured data. Efficient retrieving of relevant answers to a keyword query and effective ranking of these answers according to their relevance are two main challenges in the keyword search over graph-structured data. In this paper, a novel scoring function is proposed, w...
متن کاملAn Efficient Approach for Keyword Selection; Improving Accessibility of Web Contents by General Search Engines
General search engines often provide low precise results even for detailed queries. So there is a vital need to elicit useful information like keywords for search engines to provide acceptable results for user’s search queries. Although many methods have been proposed to show how to extract keywords automatically, all attempt to get a better recall, precision and other criteria which describe h...
متن کاملICRA: Effective Semantics for Ranked XML Keyword Search
Keyword search is a user-friendly way to query XML databases. Most previous efforts in this area focus on keyword proximity search in XML based on either tree data model or graph (or digraph) data model. Tree data model for XML is generally simple and efficient for keyword proximity search. However, it cannot capture connections such as ID references in XML databases. In the contrast, technique...
متن کاملTruthful polynomial time optimal welfare keyword auctions with budget constraints
In keyword auctions, advertisers bid for keywords. Currently, bids and allocations are made on a per keyword basis. We show that this mechanism is neither efficient nor truthful under demand or budget constraints and provide a truthful efficient (quasi) polynomial mechanism for allocating keywords under budget constraints. As a side effect our proposed mechanism has higher revenue than the curr...
متن کاملEfficient Keyword Query Routing for Search Engines
Increasing data on web has resulted in increasing challenge for keyword query routing. Top k routing is an approach used for keyword query search. Keyword query routing work efficiently for one or two keyword but its efficiency drastically reduces while handling multiple keywords. Our approach is to increase the efficiency even for multiple keyword querying. We are going to follow keyword-eleme...
متن کامل